import java.util.Scanner;

public class Test {
        public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            int n = in.nextInt();
            int m = in.nextInt();
            int q = in.nextInt();
            int[][] arr = new int[n + 1][m + 1];
            for(int i = 1;i <= n;i ++) {
                for(int j = 1;j <= m;j ++) {
                    arr[i][j] = in.nextInt();
                }
            }
            long[][] dp = new long[n + 1][m + 1];
            for(int i = 1;i <= n;i ++) {
                for(int j = 1;j <= m;j ++) {
                    dp[i][j] = dp[i-1][j] + dp[i][j-1] + arr[i][j]  - dp[i-1][j-1];
                }
            }

            while(q != 0) {
                int x1 = in.nextInt();
                int y1 = in.nextInt();
                int x2 = in.nextInt();
                int y2 = in.nextInt();
                System.out.println(dp[x2][y2] - dp[x1-1][y2] - dp[x2][y1-1] + dp[x1-1][y1-1]);
                q --;
            }
        }
    }
